// Problem: 
// Contest: 
// URL: 
// Memory Limit: 
// Time Limit: 
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read(){
	int s=0,w=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
	while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
	return s*w;
}
int n;
int s[10000]={1};
void print(int c)
{
	for(int i=1;i<=c-1;i++)
	{
		cout<<s[i]<<"+";
	}
	cout<<s[c]<<endl;
}
void dfs(int x,int c)
{
	for(int i=s[c-1];i<=x;i++)
	{
		if(i<n)
		{
			s[c]=i;
			x-=i;
			if(x==0)print(c);
			else dfs(x,c+1);
			x+=i;
		}
	}
}
signed main()
{

	cin>>n;
	dfs(n,1);
	return 0;
}
